New methods for nonlinear BVPs on the half-axis using Runge-Kutta IVP-solvers
نویسندگان
چکیده
The scalar BVP du dx2 −mu = −f (x, u) , x ∈ (0,∞) , u (0) = μ1, lim x→∞ u (x) = 0, on the infinite interval [0,∞) is considered. Under some natural assumptions it is shown that on an arbitrary finite grid there exists a unique three-point exact difference scheme (EDS), i.e., a difference scheme of which the solution coincides with the projection onto the grid of the exact solution of the corresponding differential equation. A constructive algorithm is proposed to derive from the EDS a so-called truncated difference scheme (TDS) of a given rank n̄ = 2[(n + 1)/2], provided that the righthand side possesses n continuous derivatives between a finite number of discontinuity points. Here [·] denotes the entire part of the expression in brackets. The n̄-TDS possesses the order of accuracy O(|h|) w.r.t. the maximal step size |h|. The n̄-TDS is represented by a system of nonlinear algebraic equations for the approximate values of the exact solution on the grid. Iterative methods for its numerical solution are discussed. Numerical examples are given which illustrate the theorems proved. ∗email:[email protected] †email:[email protected] ‡email:[email protected] §email:[email protected]
منابع مشابه
DIFFERENCE SCHEMES FOR NONLINEAR BVPs USING RUNGE-KUTTA IVP-SOLVERS
Difference schemes for two-point boundary value problems for systems of first-order nonlinear ordinary differential equations are considered. It was shown in former papers of the authors that starting from the two-point exact difference scheme (EDS) one can derive a so-called truncated difference scheme (TDS) which a priori possesses an arbitrary given order of accuracy (|h|m) with respect to t...
متن کاملBit ? ? ( 199 ? ) , ? ? ? { ? ? ? . Approximating Runge { Kutta Matricesby Triangular
The implementation of implicit Runge{Kutta methods requires the solution of large systems of non-linear equations. Normally these equations are solved by a modiied Newton process, which can be very expensive for problems of high dimension. The recently proposed triangularly implicit iteration methods for ODE-IVP solvers 5] substitute the Runge{Kutta matrix A in the Newton process for a triangul...
متن کاملImproved Implementation of Multiple Shooting for BVPs
Boundary value problems arise in many applications, and shooting methods are one approach to approximate the solution of such problems. A Shooting method transforms a boundary value problem into a sequence of initial value problems, and takes the advantage of the speed and adaptivity of initial value problem solvers. The implementation of continuous Runge-Kutta methods with defect control for i...
متن کاملTriangularly Implicit Iteration Methods for ODE-IVP Solvers
It often happens that iteration processes used for solving the implicit relations arising in ODE-IVP methods only start to converge rapidly after a certain number of iterations. Fast convergence right from the beginning is particularly important if we want to use so-called step-parallel iteration in which the iteration method is concurrently applied at a number of step points. In this paper, we...
متن کاملA probabilistic model for the numerical solution of initial value problems
Like many numerical methods, solvers for initial value problems (IVPs) on ordinary differential equations estimate an analytically intractable quantity, using the results of tractable computations as inputs. This structure is closely connected to the notion of inference on latent variables in statistics. We describe a class of algorithms that formulate the solution to an IVP as inference on a l...
متن کامل